on $bullet$-lict signed graphs $l_{bullet_c}(s)$ and $bullet$-line signed graphs $l_bullet(s)$

نویسندگان

mukti acharya

rashmi jain

sangita kansal

چکیده

a emph{signed graph} (or, in short, emph{sigraph}) $s=(s^u,sigma)$ consists of an underlying graph $s^u :=g=(v,e)$ and a function $sigma:e(s^u)longrightarrow {+,-}$, called the signature of $s$. a emph{marking} of $s$ is a function $mu:v(s)longrightarrow {+,-}$. the emph{canonical marking} of a signed graph $s$, denoted $mu_sigma$, is given as $$mu_sigma(v) := prod_{vwin e(s)}sigma(vw).$$the line-cut graph (or, in short, emph{lict graph}) of a graph $g=(v,e)$, denoted by $l_c(g)$, is the graph with vertex set $e(g)cup c(g)$, where $c(g)$ is the set of cut-vertices of $g$, in which two vertices are adjacent if and only if they correspond to adjacent edges of $g$ or one vertex corresponds to an edge $e$ of $g$ and the other vertex corresponds to a cut-vertex $c$ of $g$ such that $e$ is incident with $c$.in this paper, we introduce emph{dot-lict signed graph} (or emph{$bullet$-lict signed graph}) $l_{bullet_c}(s)$, which has $l_c(s^u)$ as its underlying graph. every edge $uv$ in $l_{bullet_c}(s)$ has the sign $mu_sigma(p)$, if $u, v in e(s)$ and $pin v(s)$ is a common vertex of these edges, and it has the sign $mu_sigma(v)$, if $uin e(s)$ and $vin c(s)$.we characterize signed graphs on $k_p$, $pgeq2$, on cycle $c_n$ and on $k_{m,n}$ which are $bullet$-lict signed graphs or $bullet$-line signed graphs, characterize signed graphs $s$ so that $l_{bullet_c}(s)$ and $l_bullet(s)$ are balanced. we also establish the characterization of signed graphs $s$ for which $ssim l_{bullet_c}(s)$, $ssim l_bullet(s)$, $eta(s)sim l_{bullet_c}(s)$ and $eta(s)sim l_bullet(s)$, here $eta(s)$ is negation of $s$ and $sim$ stands for switching equivalence.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On net-Laplacian Energy of Signed Graphs

A signed graph is a graph where the edges are assigned either positive ornegative signs. Net degree of a signed graph is the dierence between the number ofpositive and negative edges incident with a vertex. It is said to be net-regular if all itsvertices have the same net-degree. Laplacian energy of a signed graph is defined asε(L(Σ)) =|γ_1-(2m)/n|+...+|γ_n-(2m)/n| where γ_1,...,γ_n are the ei...

متن کامل

More Equienergetic Signed Graphs

The energy of signed graph is the sum of the absolute values of the eigenvalues of its adjacency matrix. Two signed graphs are said to be equienergetic if they have same energy. In the literature the construction of equienergetic signed graphs are reported. In this paper we obtain the characteristic polynomial and energy of the join of two signed graphs and thereby we give another construction ...

متن کامل

Weak signed Roman domination in graphs

A {em weak signed Roman dominating function} (WSRDF) of a graph $G$ with vertex set $V(G)$ is defined as afunction $f:V(G)rightarrow{-1,1,2}$ having the property that $sum_{xin N[v]}f(x)ge 1$ for each $vin V(G)$, where $N[v]$ is theclosed neighborhood of $v$. The weight of a WSRDF is the sum of its function values over all vertices.The weak signed Roman domination number of $G...

متن کامل

Weak signed Roman k-domination in graphs

Let $kge 1$ be an integer, and let $G$ be a finite and simple graph with vertex set $V(G)$.A weak signed Roman $k$-dominating function (WSRkDF) on a graph $G$ is a function$f:V(G)rightarrow{-1,1,2}$ satisfying the conditions that $sum_{xin N[v]}f(x)ge k$ for eachvertex $vin V(G)$, where $N[v]$ is the closed neighborhood of $v$. The weight of a WSRkDF $f$ is$w(f)=sum_{vin V(G)}f(v)$. The weak si...

متن کامل

Projective-planar signed graphs and tangled signed graphs

A projective-planar signed graph has no two vertex-disjoint negative circles. We prove that every signed graph with no two vertex-disjoint negative circles and no balancing vertex is obtained by taking a projective-planar signed graph or a copy of −K5 and then taking 1, 2, and 3-sums with balanced signed graphs.

متن کامل

Signed total Italian k-domination in graphs

Let k ≥ 1 be an integer, and let G be a finite and simple graph with vertex set V (G). A signed total Italian k-dominating function (STIkDF) on a graph G is a functionf : V (G) → {−1, 1, 2} satisfying the conditions that $sum_{xin N(v)}f(x)ge k$ for each vertex v ∈ V (G), where N(v) is the neighborhood of $v$, and each vertex u with f(u)=-1 is adjacent to a vertex v with f(v)=2 or to two vertic...

متن کامل

منابع من

با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید


عنوان ژورنال:
transactions on combinatorics

ناشر: university of isfahan

ISSN 2251-8657

دوره 5

شماره 1 2016

میزبانی شده توسط پلتفرم ابری doprax.com

copyright © 2015-2023